An Admission-Control-Based Dynamic Query Tree Protocol for Fast Moving RFID Tag Identification

As one of the key techniques used in perception layer Industrial Internet Things (IIoT), radio frequency identification (RFID) has been widely applied for object tracing, smart warehouse management, product line monitoring, etc. In most applications, conveyor belts are prevalently implemented to accelerate sorting efficiency goods management. However, such a system, tags quickly go through reader’s reading range resulting constant changing tag set and limited participating time moving tags. result, it poses more challenges problem mobile systems than traditional static applications. this work, novel admission-control-based dynamic query tree (ACDQT) protocol is proposed fast-moving identification. ACDQT, two main strategies developed, i.e., multi-round admission control (MRAC) recognition (DQTR). MRAC, process multiple rounds analyzed, number admitted each round optimized. Thus, lost ratio guaranteed, can be effectively accelerated. DQTR, colliding grouped into subsets with help consecutive bits responses. By constructing tree, collision slots greatly reduced, single improved significantly. With MRAC ACDQT support higher flow rate existing works. Both theoretical analyses simulation results presented demonstrate effectiveness ACDQT.